Efficient Packet Forwarding in Mesh Network
نویسندگان
چکیده
منابع مشابه
Efficient Packet Forwarding in Mesh Network
Wireless mesh Network (WMN) is a multi hop low cost, with easy maintenance robust network providing reliable service coverage. WMNs consist of mesh routers and mesh clients. In this architecture, while static mesh routers form the wireless backbone, mesh clients access the network through mesh routers as well as directly meshing with each other. Different from traditional wireless networks, WMN...
متن کاملHOP-by-HOP Packet Forwarding Mechanism in Wireless Mesh Network
A Wireless Mesh Network is infrastructure-less, "Self organizing & Self configured" network where participating node automatically establish & maintain connectivity amongst themselves. Such type of networks difficult to provide internet access and connection in remote areas. In literature lot of methods are proposed in order to handle problem in this network but in recent year we foun...
متن کاملEuropa: Efficient User Mode Packet Forwarding in Network Virtualization
Network virtualization provides the ability to run concurrent virtual networks over a shared substrate. However, it is challenging to design such a platform to host multiple heterogeneous and often highly customized virtual networks. Not only minimal interference among different virtual networks is desired, high-speed packet forwarding is also required. This paper presents Europa, a virtual net...
متن کاملEnergy-Efficient Parallel Packet Forwarding
As the Internet traffic continues growing rapidly, parallel packet forwarding becomes a necessity in Internet infrastructure to meet the throughput requirement. On the other hand, energy/ power consumption has been a critical challenge for Internet infrastructure. It has been shown that two thirds of power dissipation inside a core router is due to packet forwarding. This chapter studies the pr...
متن کاملPacket Forwarding Algorithms in a Line Network
We initiate a competitive analysis of packet forwarding policies for maximum and average flow in a line network. We show that the policies Earliest Arrival and Furthest-To-Go are scalable, but not constant competitive, for maximum flow. We show that there is no constant competitive algorithm for average flow.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Interactive Mobile Technologies (iJIM)
سال: 2012
ISSN: 1865-7923
DOI: 10.3991/ijim.v6i2.1991